搜索资源列表
PRIM
- PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。-PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
prim3
- 最小生成树 最小生成树 prim-Minimum spanning tree minimum spanning tree minimum spanning tree minimum spanning tree prim
prim
- 数据结构中的最小生成树实现，根据核心算法在Visual studio6.0的开发环境中运行成功。-Data structure to achieve the minimum spanning tree, according to the core algorithm in the development environment Visual studio6.0 run successfully.
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
prim
- 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
prim
- 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（Minimun Spanning Tree），简称为MST。 Prim算法的基本思想是： (1) 在图G=(V, E) （V表示顶点 ，E表示边）中，从集合V中任取一个顶点（例如取顶点v0）放入集合 U中，这时 U={v0}，集合T(E)为空。 (2) 从v0出发寻找与U中顶点相邻（另一顶点在V中）权值最小的边的另一顶点v1，并使v1加入U。即U={v0,v1 }
B
- Prim算法完整实现代码收藏 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete collection of code using Prim algorithm for undirected graph of the minimum spanning tree
Prim
- prim算法是常用的一种解决最小生成树问题的算法-There are three reasons for the changes that have taken place in our life.Firstly，people s living standard has been greatly improved.Secondly，most people are well paid， and they can afford what they need or like.Last but not
PRIM
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
prim
- 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
spanning_tree
- 最小生成树的多种形式。Kruskal邻接表，正向表，prim+binary_heap邻接表正向表，prim+mapped_heap邻接表正向表.-Minimum spanning tree in many forms. Kruskal adjacency list, forward the table, prim+ binary_heap forward adjacency list table, prim+ mapped_heap forward adjacency list table.
Prim
- 应用Prim算法构造最小生成树，是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
prim
- purim算法构造最小生成树的程序 大家来下啊-purim
PrimAlgorithm
- 最小生成树prim算法，Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
zuixiaoshengchengshu
- Prim算法构造 最小生成树 -Prim算法构造 最小生成树
prim
- c语言实现的Prim算法，用来求无向图的最小生成树-failed to translate
prim
- C++，用PRIM算法求最小生成树，能输入顶点和边,计算最小生成树-C++, with the PRIM for the Minimum Spanning Tree, can enter the vertex and edge to calculate the minimum spanning tree
prim
- 基于最小生成树定理实现图最小生成树的prim算法-Implementation plan based on the theorem of minimum spanning tree minimum spanning tree algorithm prim
matlab
- matlab程序：最小生成树prim算法、最小生成树kruskal算法、穷举法求哈密顿圈；以及计算旅行商路线的lingo程序-Prim minimum spanning tree algorithm, matlab program